Two-Hop Virtual Path Layout in Tori
نویسندگان
چکیده
We consider a problem motivated by the design of ATM (Asynchronous Transfer Mode) networks. Given a physical network and an All-to-All traffic, the problem consists in designing a virtual network with a given diameter, which can be embedded in the physical one with a minimum congestion (the congestion is the maximum load of a physical link). Here we propose a method to solve this problem when the diameter is 2 and we use this method to find the optimal solution when the physical network is a mesh or a torus.
منابع مشابه
Virtual Path Layouts in ATM Networks
We study virtual path layouts in a very popular type of fast interconnection networks, namely ATM networks. One of the main problems in such networks is to construct path layout that minimizes the hop-number (i.e. the number of virtual paths between any two nodes) as a function of edge congestion (i.e. the number of virtual paths going through a link). In this paper we construct for any n verte...
متن کاملVirtual path layouts optimizing total hop count on ATM tree networks
This paper presents some algorithmic results concerning virtual path layouts for the one-to-many communication problem in ATM tree networks. The ATM network model is based on covering the network with a layout of virtual paths, under some constraints on the allowed load, namely, the number of paths that can share an edge. The quality measure used is the hop count, namely, the number of edges tr...
متن کاملDirected Virtual Path Layouts in ATM Networks
Motivated by Asynchronous Transfer Mode (ATM) in telecommunication networks, we investigate the problem of designing a directed virtual topology on a directed physical topology, which consists in nding a set of directed virtual paths (VPs) satisfying some constraints in terms of load (the number of VPs sharing a physical link) and hop count (the number of VPs used to establish a connection). Fo...
متن کاملVirtual Path Layouts with Low Congestion or Low Diameter in ATM Networks
Motivated by Asynchronous Transfer Mode (ATM) in telecommunication networks, we investigate the problem of designing a directed virtual topology on a directed physical topology, which consists in nding a set of directed virtual paths (VPs) satisfying some constraints in terms of load (the number of VPs sharing a physical link) and hop count (the number of VPs used to establish a connection). Fo...
متن کاملA Complete Characterization of the Path Layout Construction Problem for ATM Networks with Given Hop Count and Load (Extended Abstract)
We investigate the time complexity of deciding the existence of layouts of virtual paths in high-speed networks, that enable a connection from one vertex to all others and have maximum hop count h and maximum edge load l , for a stretch factor of one. We prove that the problem of determining the existence of such layouts is NP-complete for every given values of h and l, except for the cases h =...
متن کامل